Independent Complementary Distance Pattern Uniform Graphs
نویسنده
چکیده
A graph G = (V,E) is called to be Smarandachely uniform k-graph for an integer k ≥ 1 if there exists M1,M2, · · · ,Mk ⊂ V (G) such that fMi(u) = {d(u, v) : v ∈ Mi} for ∀u ∈ V (G)−Mi is independent of the choice of u ∈ V (G)−Mi and integer i, 1 ≤ i ≤ k. Each such set Mi, 1 ≤ i ≤ k is called a CDPU set [6, 7]. Particularly, for k = 1, a Smarandachely uniform 1-graph is abbreviated to a complementary distance pattern uniform graph, i.e., CDPU graphs. This paper studies independent CDPU graphs.
منابع مشابه
M-Complementary Distance Uniform Matrix of a Graph
A graph G = (V,E) is Complementary Distance Pattern Uniform if there exists M ⊂ V (G) such that fM (u) = {d(u, v) : v ∈ M}, for every u ∈ V (G)−M , is independent of the choice of u ∈ V (G)−M and the set M is called the Complementary Distance Pattern Uniform Set (CDPU set). The M -Complementary Distance Uniform Matrix (M CDU Matrix), CM (G) = [cij ] of G of order n is a p × m matrix, where m is...
متن کاملOn Complementary Distance Signless Laplacian Spectral Radius and Energy of Graphs
Let $D$ be a diameter and $d_G(v_i, v_j)$ be the distance between the vertices $v_i$ and $v_j$ of a connected graph $G$. The complementary distance signless Laplacian matrix of a graph $G$ is $CDL^+(G)=[c_{ij}]$ in which $c_{ij}=1+D-d_G(v_i, v_j)$ if $ineq j$ and $c_{ii}=sum_{j=1}^{n}(1+D-d_G(v_i, v_j))$. The complementary transmission $CT_G(v)$ of a vertex $v$ is defined as $CT_G(v)=sum_{u in ...
متن کاملUniform Mixing on Cayley Graphs
This thesis investigates uniform mixing on Cayley graphs over Z3. We apply Mullin’s results on Hamming quotients, and characterize the 2(d+2)-regular connected Cayley graphs over Z3 that admit uniform mixing at time 2π/9. We generalize Chan’s construction on the Hamming scheme H(d, 2) to the schemeH(d, 3), and find some distance graphs of the Hamming graph H(d, 3) that admit uniform mixing at t...
متن کاملGraph Products of Open Distance Pattern Uniform Graphs
Given an arbitrary non-empty subset M of vertices in a graph G = (V,E), each vertex u in G is associated with the set f o M(u) = {d(u, v) : v ∈ M, u 6= v}, called its open M-distance-pattern. The graph G is called open distancepattern uniform (odpu-) graph if there exists a subset M of V (G) such that f o M(u) = f o M(v) for all u, v ∈ V (G) and M is called an open distance-pattern uniform (odp...
متن کاملBi-Distance Pattern Uniform Number
A graph G = (V,E) is BiDistance Pattern Uniform if there exists M ⊆ V (G) such that the M−distance pattern fM(u) = {d(u, v) : v ∈ M} is identical for all u in M and fM (v) is identical for all v in V −M. The set M is called Bi-DPU set. The least cardinality of Bi-DPU set in G is called the Bi-DPU number of G. In this paper, we initiate a study on Bi-DPU number of different classes of graphs. Ma...
متن کامل